Applicative Theories and Explicit Mathematics
نویسندگان
چکیده
[5] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [6] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [9] Susumu Hayashi and Satoshi Kobayashi. A new formulation of Feferman's system of functions and classes and its relation to Frege structures.
منابع مشابه
The proof-theoretic analysis of the Suslin operator in applicative theories
In this article we introduce the Suslin quantification functional E1 into the framework of Feferman’s explicit mathematics and analyze it from the point of view of proof theory. More precisely, we work in the first order part of explicit mathematics augmented by appropriate axioms for E1. Then we establish the exact proof-theoretic relationship between these applicative theories and (subsystems...
متن کاملElementary explicit types and polynomial time operations
This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polynomial time. The systems considered are natural extensions of the first-order applicative theories...
متن کاملTheories with self-application and computational complexity
Applicative theories form the basis of Feferman’s systems of explicit mathematics, which have been introduced in the early seventies. In an applicative universe, all individuals may be thought of as operations, which can freely be applied to each other: self-application is meaningful, but not necessarily total. It has turned out that theories with self-application provide a natural setting for ...
متن کاملPolynomial Time Operations in Explicit Mathematics
In this paper we study self applicative theories of operations and binary words in the context of polynomial time computability We propose a rst order theory PTO which allows full self application and whose provably total functions on W f g are exactly the polynomial time computable func tions Our treatment of PTO is proof theoretic and very much in the spirit of reductive proof theory
متن کاملPartial Applicative Theories and Explicit Substitutions
Systems based on theories with partial self-application are relevant to the formalization of constructive mathematics and as a logical basis for functional programming languages. In the literature they are either presented in the form of partial combinatory logic or the partial calculus, and sometimes these two approaches are erroneously considered to be equivalent. In this paper we address som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003